#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N];
int n;
int num;
queue <int> q;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    num=n;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    q.push(a[1]);
    for (int i=2;i<=n;i++)
    {
        int p=q.front();
        if (a[i]>p)
        {
            num--;
            q.pop();
        }
        q.push(a[i]);
    }
    cout<<num;
    return 0;

}
